skew-spectra and skew energy of various products of graphs
نویسندگان
چکیده
given a graph $g$, let $g^sigma$ be an oriented graph of $g$ with the orientation $sigma$ and skew-adjacency matrix $s(g^sigma)$. then the spectrum of $s(g^sigma)$ consisting of all the eigenvalues of $s(g^sigma)$ is called the skew-spectrum of $g^sigma$, denoted by $sp(g^sigma)$. the skew energy of the oriented graph $g^sigma$, denoted by $mathcal{e}_s(g^sigma)$, is defined as the sum of the norms of all the eigenvalues of $s(g^sigma)$. in this paper, we give orientations of the kronecker product $hotimes g$ and the strong product $hast g$ of $h$ and $g$ where $h$ is a bipartite graph and $g$ is an arbitrary graph. then we determine the skew-spectra of the resultant oriented graphs. as applications, we construct new families of oriented graphs with optimum skew energy. moreover, we consider the skew energy of the orientation of the lexicographic product $h[g]$ of a bipartite graph $h$ and a graph $g$.
منابع مشابه
Skew-spectra and Skew Energy of Various Products of Graphs
Given a graph G, let G be an oriented graph of G with the orientation σ and skewadjacency matrix S(G). Then the spectrum of S(G) consisting of all the eigenvalues of S(G) is called the skew-spectrum of G, denoted by Sp(G). The skew energy of the oriented graph G, denoted by ES(G), is defined as the sum of the norms of all the eigenvalues of S(G). In this paper, we give orientations of the Krone...
متن کاملSkew Spectra of Oriented Graphs
An oriented graph G is a simple undirected graph G with an orientation σ, which assigns to each edge a direction so that G becomes a directed graph. G is called the underlying graph of G, and we denote by Sp(G) the adjacency spectrum of G. Skew-adjacency matrix S(G) of G is introduced, and its spectrum SpS(G ) is called the skew-spectrum of G . The relationship between SpS(G ) and Sp(G) is stud...
متن کاملOn the Skew Spectra of Cartesian Products of Graphs
An oriented graph G is a simple undirected graph G with an orientation σ, which assigns to each edge of G a direction so that G becomes a directed graph. G is called the underlying graph of G and we denote by S(G) the skew-adjacency matrix of G and its spectrum Sp(G) is called the skew-spectrum of G. In this paper, the skew spectra of two orientations of the Cartesian product of two graphs are ...
متن کاملSkew Spectra of Oriented Bipartite Graphs
A graph G is said to have a parity-linked orientation φ if every even cycle C2k in G is evenly (resp. oddly) oriented whenever k is even (resp. odd). In this paper, this concept is used to provide an affirmative answer to the following conjecture of D. Cui and Y. Hou [D. Cui, Y. Hou, On the skew spectra of Cartesian products of graphs, The Electronic J. Combin. 20(2):#P19, 2013]: Let G = G(X,Y ...
متن کاملskew randi'c matrix and skew randi'c energy
let $g$ be a simple graph with an orientation $sigma$, which assigns to each edge a direction so that $g^sigma$ becomes a directed graph. $g$ is said to be the underlying graph of the directed graph $g^sigma$. in this paper, we define a weighted skew adjacency matrix with rand'c weight, the skew randi'c matrix ${bf r_s}(g^sigma)$, of $g^sigma$ as the real skew symmetric mat...
متن کاملOn oriented graphs with minimal skew energy
Let S(Gσ) be the skew-adjacency matrix of an oriented graph Gσ . The skew energy of Gσ is the sum of all singular values of its skew-adjacency matrix S(Gσ). This paper first establishes an integral formula for the skew energy of an oriented graph. Then, it determines all oriented graphs with minimal skew energy among all connected oriented graphs on n vertices with m (n ≤ m < 2(n− 2)) arcs, whi...
متن کاملمنابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
transactions on combinatoricsناشر: university of isfahan
ISSN 2251-8657
دوره 4
شماره 2 2015
میزبانی شده توسط پلتفرم ابری doprax.com
copyright © 2015-2023